Edge-symmetric graphs
نویسندگان
چکیده
منابع مشابه
Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes
We present a symmetric LDPC code with constant rate and constant distance (i.e. good LDPC code) that its constraint space is generated by the orbit of one constant weight constraint under a group action. Our construction provides the first symmetric LDPC good codes. This solves the main open problem raised by Kaufman and Wigderson in [4].
متن کاملEdge-isoperimetric inequalities for the symmetric product of graphs
The k-th symmetric product of a graph G with vertex set V with edge set E is a graph G{k} with vertices as k-sets of V , where two k-sets are connected by an edge if and only if their symmetric difference is an edge in E . Using the isoperimetric properties of the vertex-induced subgraphs of G and Sobolev inequalities on graphs, we obtain various edge-isoperimetric inequalities pertaining to th...
متن کاملEdge-connectivity augmentation of graphs over symmetric parity families
In this note we solve the edge-connectivity augmentation problem over symmetric parity families. It provides a solution for the minimum T-cut augmentation problem. We also extend a recent result of C. Q. Zhang [8].
متن کاملClassifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1982
ISSN: 0021-8693
DOI: 10.1016/0021-8693(82)90074-6